Most frugal explanations in Bayesian networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Most frugal explanations in Bayesian networks

Inferring the most probable explanation to a set of variables, given a partial observation of the remaining variables, is one of the canonical computational problems in Bayesian networks, with widespread applications in AI and beyond. This problem, known as MAP, is computationally intractable (NP-hard) and remains so even when only an approximate solution is sought. We propose a heuristic formu...

متن کامل

Most probable explanations in Bayesian networks: Complexity and tractability

An overview is given of definitions and complexity results of a number of variants of the problem of probabilistic inference of the most probable explanation of a set of hypotheses given observed phenomena.

متن کامل

Structure Approximation of Most Probable Explanations in Bayesian Networks

Abstract Typically, when one discusses approximation algorithms for (NP-hard) problems (like TRAVELING SALESPERSON, VERTEX COVER, KNAPSACK), one refers to algorithms that return a solution whose value is (at least ideally) close to optimal; e.g., a tour with almost minimal length, a vertex cover of size just above minimal, or collection of objects that has close to maximal value. In contrast, o...

متن کامل

Tractability of most probable explanations in multidimensional Bayesian network classifiers

Multidimensional Bayesian network classifiers have gained popularity over the last few years due to their expressive power and their intuitive graphical representation. A drawback of this approach is that their use to perform multidimensional classification, a generalization of multi-label classification, can be very computationally demanding when there are a large number of class variables. Th...

متن کامل

Abstraction for Ef ciently Computing Most Probable Explanations in Bayesian Networks

ion for Ef ciently Computing Most Probable Explanations in Bayesian Networks Ole J. Mengshoel Carnegie Mellon University NASA Ames Research Center Mail Stop 269-3 Moffett Field, CA 94035 [email protected]

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2015

ISSN: 0004-3702

DOI: 10.1016/j.artint.2014.10.001